Quantum walks and quantum computation
نویسنده
چکیده
The field of quantum information applies the concepts of quantum physics to problems in computer science, and shows great potential for allowing efficient computation. In this thesis I concentrate on a particular quantum information theoretic tool known as the quantum walk. There are two widely studied versions of the quantum walk, the continuous time walk, and the discrete time walk. The discrete time walk is particularly amenable to investigation using numerical methods, from which most of the results in this thesis are derived, and is the main focus of the work presented. Two aspects of the discrete time walk are investigated: their transport properties and their interpretation as quantum computers. I investigated the transport properties in two ways, by looking for a particular type of transport known as perfect state transfer, and examining the transport properties of a new type of coin operator. The search for perfect state transfer concentrated on modifications of small cycles. I found that perfect state transfer is rare for the choices of coin operators tested. The structures tested for perfect state transfer were based on cycles, and it appears that the type of modification has more of an effect than the size of the cycle. This makes intuitive sense, as the modifications found to lead to walks exhibiting perfect state transfer affected only the initial and target node of the cycle. I then investigated a new type of coin operator which does not allow amplitude to return to the node it has come from. This effectively simulates a dimer. Using the general form of this type of operator and random variables for each parameter, I found that the expected distance of the walker from the origin, and standard deviation, were independent of the initial condition. The second half of the thesis concentrates on computational applications of quantum walks using the language acceptance model. I first note their equivalence to a type of quantum automaton known as the QFA-WOM, and this provides an intuitive understanding of the role of the WOM. I then use a more direct construction to show that they can accept a range of formal languages. Using this construction allows us to use superpositions of words as inputs, and the insights provided by investigating these suggest a new way of approaching the problem of quantum state discrimination.
منابع مشابه
Analysis of Absorbing Times of Quantum Walks
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard walks on the line and symmetric walks on the hypercube from the viewpoint of absorbing probability and time. Our results may be suggestive in constructing eff...
متن کاملFormal languages analysed by quantum walks
Discrete time quantum walks are known to be universal for quantum computation. This has been proven by showing that they can simulate a universal gate set. In this paper we examine computation in terms of language acceptance and present two ways in which discrete time quantum walks can accept some languages with certainty. These walks can take quantum as well as classical inputs, and we show th...
متن کاملThe expressive power of quantum walks in terms of language acceptance
Discrete time quantum walks are known to be universal for quantum computation. This has been proven by showing that they can simulate a universal quantum gate set. In this paper, we examine computation by quantum walks in terms of language acceptance, and present two ways in which discrete time quantum walks can accept some languages with certainty. These walks can take quantum as well as class...
متن کاملMicroscopic derivation of open quantum walks
Recently, a formalism for discrete time open quantum walks was introduced [1]. The formalism suggested is similar to the formalism of quantum Markov chains and rests upon the implementation of appropriate completely positive maps. The formalism of the open quantum random walks (OQW) includes the classical random walk and through a physical realization procedure a connection to the unitary quant...
متن کاملCoalgebraic Walks, in Quantum and Turing Computation
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of a monad (powerset and distribution), in an obvious manner. It is shown that also quantum walks are coalgebras of a new monad, involving additional control structure. This new monad is also used to describe Turing mac...
متن کاملTheoretical computation of the quantum transport of zigzag mono-layer Graphenes with various z-direction widths
The quantum transport computations have been carried on four different width of zigzag graphene using a nonequilibrium Green’s function method combined with density functional theory. The computed properties are included transmittance spectrum, electrical current and quantum conductance at the 0.3V as bias voltage. The considered systems were composed from one-layer graphene sheets differing w...
متن کامل